Computer Science for IGCSE & O level - Boolean Logic (Section 3 - No. 40)
How can we express NOT (A AND B) in Boolean algebra?
A + B
A' . B'
A' + B'
A . B'
解释
Using De Morgan's theorem, NOT (A AND B) is equal to (NOT A) OR (NOT B), represented as A' + B'.